منابع مشابه
Spanning Trees and Function Classes
If G = Kn is the complete graph, the classical Prüffer correspondence gives a natural bijection between all spanning trees of G (i.e., all Cayley trees) and all functions from a set of n−2 elements to a set of n elements. If G is a complete multipartite graph, then such bijections have been studied by Eğecioğlu and Remmel. In this paper, we define a class of directed graphs, called filtered dig...
متن کاملMinimum Spanning Trees for Minor-Closed Graph Classes in Parallel
For each minor-closed graph class we show that a simple variant of Borůvka’s algorithm computes a MST for any input graph belonging to that class with linear costs. Among minor-closed graph classes are e.g planar graphs, graphs of bounded genus, partial k-trees for fixed k, and linkless or knotless embedable graphs. The algorithm can be implemented on a CRCW PRAM to run in logarithmic time with...
متن کاملNetworks and Spanning Trees
In 1857 Arthur Cayley (1821–1895) published a paper [9] that introduces the term “tree” to describe the logical branching that occurs when iterating the fundamental process of (partial) differentiation. When discussing the composition of four symbols that involve derivatives, Cayley writes “But without a more convenient notation, it would be difficult to find [their] corresponding expressions ....
متن کاملSpanning Trees and Spanners
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
متن کاملSpanning Trees in 2-trees
A spanning tree of a graph G is a connected acyclic spanning subgraph of G. We consider enumeration of spanning trees when G is a 2-tree, meaning that G is obtained from one edge by iteratively adding a vertex whose neighborhood consists of two adjacent vertices. We use this construction order both to inductively list the spanning trees without repetition and to give bounds on the number of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2002
ISSN: 1077-8926
DOI: 10.37236/1650